On Orientations and Shortest Paths
نویسندگان
چکیده
An orientation of an undirected graph is a choice of direction for each of its edges. An orientation is called ideal with respect to a given set of pairs of vertices if it does not increase the shortest-path distances between the members of any of the pairs. A polynomial-time algorithm is given for constructing an ideal orientation with respect to two given pairs and any positive edge-lengths, or else recognizing that no such orientation exists. Moreover, we show that this problem is in the class NC. For a general number of pairs the problem is proven NP-complete even with unit edgelengths.
منابع مشابه
Shortest Paths in an Arrangement with k Line Orientations
Suppose one has a line arrangement in which many lines are parallel, so that the number of diierent line orientations is k, and one wants to nd a shortest path from one point on a line in the arrangement to another such point. Using known techniques one can nd the shortest path in time and space O(n 2). We present an algorithm that can nd the shortest path in time and space O(n + k 2).
متن کاملAcyclic Orientations for Deadlock Prevention in Interconnection Networks (Extended Abstract)
In this paper we extend some of the computational results presented in 6] on the determination of an acyclic orientation of a graph which minimizes the maximum number of changes of orientations along the paths connecting a given subset of source-destination couples. The corresponding value is called the rank of the set of paths, and besides its theoretical interest has also practical applicatio...
متن کاملFinitely-Oriented Shortest Paths in the Presence of Polygonal Obstacles
Given a set of non-intersecting simple polygons, a set of points in the plane, and a set of xed orientations, we compute a graph such that for any two input points there exists a shortest path in G whose length equals the length of a shortest path between these points in the plane that does not intersect any polygon and that consists only of line segments of the given orientations. This graph m...
متن کاملA Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane
Given a set of h pairwise disjoint polygonal obstacles of totally n vertices in the plane, we study the problem of computing an L1 (or rectilinear) shortest path between two points avoiding the obstacles. Previously, this problem has been solved in O(n log n) time and O(n) space, or alternatively in O(n + h log n) time and O(n + h log h) space. A lower bound of Ω(n + h log h) time and Ω(n) spac...
متن کاملAcyclic Orientations for Deadlock Prevention in Usual Networks
Deadlock prevention for routing messages has a central role in communication networks , since it directly innuences the correctness of distributed and parallel systems. In this paper we extend some of the computational results presented in 10] on acyclic orientations for the determination of optimal deadlock free routing schemes. In this context minimizing the number of buuers, needed to preven...
متن کاملComputing L1 Shortest Paths among Polygonal Obstacles in the Plane
Given a point s and a set of h pairwise disjoint polygonal obstacles of totally n vertices in the plane, we present a new algorithm for building an L1 shortest path map of size O(n) in O(T ) time and O(n) space such that for any query point t, the length of the L1 shortest obstacleavoiding path from s to t can be reported in O(log n) time and the actual shortest path can be found in additional ...
متن کامل